Vote Trading in Public Elections (updated version)

نویسنده

  • David Hartvigsen
چکیده

During the 2000 U.S. Presidential race an apparently new idea, called vote trading, was introduced to help one of the two major-party candidates (Gore) win. The idea was, through an Internet mechanism, to induce voters who supported a minorparty candidate (Nader) to vote for Gore in states where this would help Gore and to induce an equal number of voters who supported Gore to vote for Nader in states where this would not hurt Gore. Thus Nader would receive the same number of popular votes as he would have received without the trading (providing an incentive for Nader voters to participate). Vote trading was implemented at a number of Web sites in 2000 (and again in 2004); it illustrates how information technology can be used to exploit the electoral college system; and it has the potential to alter the outcome of Presidential elections. In this paper, we formalize this idea, present several variations, and present an optimal way for Web sites to implement it (so as to best help the major-party candidate get elected) in both deterministic and stochastic settings.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Is turning out to vote a public good contribution? Evidence from a new democracy

Why do people turn out to vote? By requiring coordination and by generating positive externalities on others while involving a private cost, turning out to vote resembles a public good contribution and is therefore subject to collective action problems. While this has been established theoretically, the empirical evidence is fraught with measurement and identification problems. We investigate w...

متن کامل

An Electronic Voting System Supporting VoteWeights

Typically each voter contributes with one vote for an election. But there are some elections where voters can have different weights associated with their vote. In this paper we provide a solution for allowing an arbitrary number of weights and weight values to be used in an electronic voting system. We chose REVS, Robust Electronic Voting System, a voting system designed to support Internet vo...

متن کامل

D4.1 - Security definitions and attacker models for e-voting protocols

In 2010 Hao, Ryan and Zielinski proposed a simple decentralized e-voting protocol that only requires 2 rounds of communication. Thus, for k elections their protocol needs 2k rounds of communication. Observing that the first round of their protocol is aimed to establish the public-keys of the voters, we propose an extension of the protocol as a non-interactive e-voting scheme in the public-key s...

متن کامل

Simple method for predicting American presidential greatness from victory margin in popular vote (1824-1996).

The author tested the simple method (SM) for predicting presidential greatness from the winner's victory margin in the popular vote and A. M. Schlesinger Jr.'s (1986) cycles of American political history with the expert sample presidential rankings of W. J. Ridings Jr. and S. B. McIver (1997). The SM, which involves only simple calculations on minimal data available shortly after an election, p...

متن کامل

Predicting Elections from Biographical Information about Candidates

Traditional election forecasting models are estimated from time-series data on relevant variables and that limits the type and number of variables that can be used. Index models do not suffer from the same restrictions. We used as many as 60 biographical variables to create an index model for forecasting U.S. Presidential Elections. For each candidate, we simply counted the number of variables ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008